The Capacitated max-k-cut Problem

نویسندگان

  • Daya Ram Gaur
  • Ramesh Krishnamurti
چکیده

We consider a capacitated max k-cut problem in which a set of vertices is partitioned into k subsets. Each edge has a non-negative weight, and each subset has a possibly different capacity that imposes an upper bound on its size. The objective is to find a partition that maximizes the sum of edge weights across all pairs of vertices that lie in different subsets. We describe a local-search algorithm that obtains a solution with value no smaller than 1 − 1/k of the optimal solution value. This improves a previous bound of 1/2 for the max k-cut problem with fixed, though possibly different, sizes of subsets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Partitioning: A Heuristic Procedure to Partition Network Graphs

...................................................................................iii LIST OF FIGURES...........................................................................................iv INTRODUCTION..............................................................................................1 Scope and Motivation................................................................1 Basic D...

متن کامل

Local Search Approximation Algorithms for the Complement of the Min-k-Cut Problems

Min-k-cut is the problem of partitioning vertices of a given graph or hypergraph into k subsets such that the total weight of edges or hyperedges crossing different subsets is minimized. For the capacitated min-k-cut problem, each edge has a nonnegative weight, and each subset has a possibly different capacity that imposes an upper bound on its size. The objective is to find a partition that mi...

متن کامل

Conflict Resolution in the Scheduling of Television Commercials

We extend a model by Bollapragada and Garbiras (2004) for scheduling commercial advertisements during breaks in television programming. The proposed extension allows differential weighting of conflicts between pairs of commercials. We formulate the problem as a capacitated generalization of the max k-cut problem in which the vertices of a graph correspond to commercial insertions and the edge w...

متن کامل

A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Travel Times∗

We investigate a robust approach for solving the capacitated vehicle routing problem (CVRP) with uncertain travel times. It is based on the concept of K-adaptability, which allows to calculate a set of k feasible solutions in a preprocessing phase. Once a scenario occurs, the corresponding best solution may be picked out of the set of candidates. The aim is to determine the k candidates such th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 115  شماره 

صفحات  -

تاریخ انتشار 2005